On a Set of Almost Deterministic $k$-Independent Random Variables
نویسندگان
چکیده
منابع مشابه
A Simple Construction of Almost k-wise Independent Random Variables
We present a simple construction of a small probability space on n bits for which any k bits are almost independent. The number of bits used to specify a point in the sample space is O(log log n + k + log ~), where e is the statistical difference between of the distribution induced on any k bit locations and the uniform distribution. This is asymptotically comparable to the construction recentl...
متن کاملSimple Constructions of Almost k-Wise Independent Random Variables
We present three alternative simple constructions of small proba. bility spaces on n bits for which any k bits are almost independent. The number of bits used to specify a point in the sample space is (2 +o(l»(loglog n + log k + log ~), where f is the statistical difference between the distribution induced on any k bit locations and the uni form distribution. This is asymptotically comparable...
متن کاملAlmost k-wise Independent Variables
We will now consider the problem of creating a set of bitstrings such that the bits are almost k-wise independent. Our method consists of two steps. In the first step we create a set of bitstrings such that parity on every fixed index set is almost even. In the second step we present a method to convert such a set into a set where the bits are almost k-wise independent. For presentational reaso...
متن کاملOBDDs and (Almost) $k$-wise Independent Random Variables
OBDD-based graph algorithms deal with the characteristic function of the edge set E of a graph G = (V,E) which is represented by an OBDD and solve optimization problems by mainly using functional operations. We present an OBDD-based algorithm which uses randomization for the first time. In particular, we give a maximal matching algorithm with O(log |V |) functional operations in expectation. Th...
متن کاملAlmost sure convergence of weighted sums of independent random variables
Let (Ω,F ,P) be a probability space, and let {Xn} be a sequence of integrable centered i.i.d. random variables. In this paper we consider what conditions should be imposed on a complex sequence {bn} with |bn| → ∞, in order to obtain a.s. convergence of P n Xn bn , whenever X1 is in a certain class of integrability. In particular, our condition allows us to generalize the rate obtained by Marcin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Probability
سال: 1974
ISSN: 0091-1798
DOI: 10.1214/aop/1176996762